A comprehensive survey on the quickest path problem
نویسندگان
چکیده
منابع مشابه
A comprehensive survey on the quickest path problem
This work is a survey on a special minsum-maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal...
متن کاملDistributed algorithms for the quickest path problem
Hung, Y.-C. and G.-H. Chen, Distributed algorithms for the quickest path problem, Parallel Computing 18 (1992) 823-834. Let N=(V, A, C, L) be a network with node set V, arc set A, positive arc capacity function C, and nonnegative arc lead time function L. The quickest path problem is to find paths in N to transmit a given amount of data such that the transmission time is minimized. In this pape...
متن کاملAlgorithms for the quickest path problem and the enumeration of quickest paths
Let N = (V, R, e, I) be an input network with node set V, arc set A, positive arc weight function c and nonnegative arc weight function 1. Let u be the amount of data to be transmitted. The quickest path problem is to find a routing path in N to transmit the given amount of data in minimum time. In a recent paper, Chen and Chin proposed this problem and developed algorithms for the single pair ...
متن کاملThe Stochastic Quickest Path Problem via Minimal Paths
The quickest path problem, a version of the shortest path problem, is to find a single quickest path which sends a given amount of data from the source to the sink with minimum transmission time. More specifically, the capacity of each arc in the network is assumed to be deterministic. However, in many real-life networks such as computer systems, telecommunication systems, etc., the capacity of...
متن کاملPedestrian Traffic: on the Quickest Path
When a large group of pedestrians moves around a corner, most pedestrians do not follow the shortest path, which is to stay as close as possible to the inner wall, but try to minimize the travel time. For this they accept to move on a longer path with some distance to the corner, to avoid large densities and by this succeed in maintaining a comparatively high speed. In many models of pedestrian...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2006
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-006-0068-x